0.00/0.10 % Problem : SLH371^1 : TPTP v7.5.0. Released v7.5.0. 0.00/0.11 % Command : run_E %s %d THM 0.10/0.31 % Computer : n019.cluster.edu 0.10/0.31 % Model : x86_64 x86_64 0.10/0.31 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz 0.10/0.31 % Memory : 8042.1875MB 0.10/0.31 % OS : Linux 3.10.0-693.el7.x86_64 0.10/0.31 % CPULimit : 30 0.10/0.31 % WCLimit : 30 0.10/0.31 % DateTime : Tue Aug 9 02:55:36 EDT 2022 0.10/0.31 % CPUTime : 0.16/0.42 The problem SPC is TH0_THM_EQU_NAR 0.16/0.42 Running higher-order on 1 cores theorem proving 0.16/0.42 Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=1 --cpu-limit=30 /export/starexec/sandbox/benchmark/theBenchmark.p 0.16/0.42 # Version: 3.0pre003-ho 0.16/0.44 # Preprocessing class: HSLSSMSSSSMNSFA. 0.16/0.44 # Scheduled 1 strats onto 1 cores with 30 seconds (30 total) 0.16/0.44 # Starting post_as_ho6 with 30s (1) cores 0.16/0.44 # post_as_ho6 with pid 31766 completed with status 0 0.16/0.44 # Result found by post_as_ho6 0.16/0.44 # Preprocessing class: HSLSSMSSSSMNSFA. 0.16/0.44 # Scheduled 1 strats onto 1 cores with 30 seconds (30 total) 0.16/0.44 # Starting post_as_ho6 with 30s (1) cores 0.16/0.44 # SinE strategy is GSinE(CountFormulas,,true,2.0,0,3,20000,1.0,true) 0.16/0.44 # ...ProofStateSinE()=24/416 0.16/0.44 # Search class: HGUSF-FFMF32-SSFFFFNN 0.16/0.44 # partial match(2): HGUSF-FFMF32-SFFFMFNN 0.16/0.44 # Scheduled 5 strats onto 1 cores with 30 seconds (30 total) 0.16/0.44 # Starting full_lambda_5 with 17s (1) cores 0.16/0.44 # full_lambda_5 with pid 31767 completed with status 0 0.16/0.44 # Result found by full_lambda_5 0.16/0.44 # Preprocessing class: HSLSSMSSSSMNSFA. 0.16/0.44 # Scheduled 1 strats onto 1 cores with 30 seconds (30 total) 0.16/0.44 # Starting post_as_ho6 with 30s (1) cores 0.16/0.44 # SinE strategy is GSinE(CountFormulas,,true,2.0,0,3,20000,1.0,true) 0.16/0.44 # ...ProofStateSinE()=24/416 0.16/0.44 # Search class: HGUSF-FFMF32-SSFFFFNN 0.16/0.44 # partial match(2): HGUSF-FFMF32-SFFFMFNN 0.16/0.44 # Scheduled 5 strats onto 1 cores with 30 seconds (30 total) 0.16/0.44 # Starting full_lambda_5 with 17s (1) cores 0.16/0.44 # Preprocessing time : 0.003 s 0.16/0.44 # Presaturation interreduction done 0.16/0.44 0.16/0.44 # Proof found! 0.16/0.44 # SZS status Theorem 0.16/0.44 # SZS output start CNFRefutation 0.16/0.44 thf(decl_22, type, a_RCOSETS_a_b: partia1833973666xt_a_b > set_a > set_set_a). 0.16/0.44 thf(decl_23, type, a_l_coset_a_b: partia1833973666xt_a_b > a > set_a > set_a). 0.16/0.44 thf(decl_24, type, a_r_coset_a_b: partia1833973666xt_a_b > set_a > a > set_a). 0.16/0.44 thf(decl_25, type, additi2104487374up_a_b: set_a > partia1833973666xt_a_b > $o). 0.16/0.44 thf(decl_26, type, set_add_a_b: partia1833973666xt_a_b > set_a > set_a > set_a). 0.16/0.44 thf(decl_27, type, partia1066395285xt_a_b: partia1833973666xt_a_b > set_a). 0.16/0.44 thf(decl_28, type, units_a_ring_ext_a_b: partia1833973666xt_a_b > set_a). 0.16/0.44 thf(decl_29, type, mult_a_ring_ext_a_b: partia1833973666xt_a_b > a > a > a). 0.16/0.44 thf(decl_30, type, minus_minus_int: int > int > int). 0.16/0.44 thf(decl_31, type, minus_minus_nat: nat > nat > nat). 0.16/0.44 thf(decl_32, type, minus_1444187941_set_a: set_set_a > set_set_a > set_set_a). 0.16/0.44 thf(decl_33, type, minus_minus_set_a: set_a > set_a > set_a). 0.16/0.44 thf(decl_34, type, plus_plus_int: int > int > int). 0.16/0.44 thf(decl_35, type, plus_plus_nat: nat > nat > nat). 0.16/0.44 thf(decl_36, type, uminus_uminus_int: int > int). 0.16/0.44 thf(decl_37, type, uminus1398297877_set_a: set_set_set_a > set_set_set_a). 0.16/0.44 thf(decl_38, type, uminus1261309877_set_a: set_set_a > set_set_a). 0.16/0.44 thf(decl_39, type, uminus_uminus_set_a: set_a > set_a). 0.16/0.44 thf(decl_40, type, locali1648887798ac_a_b: partia1833973666xt_a_b > set_a > $o). 0.16/0.44 thf(decl_41, type, locali807230110ng_a_b: partia1833973666xt_a_b > set_a > $o). 0.16/0.44 thf(decl_42, type, locali880295127ng_a_b: partia1833973666xt_a_b > set_a > $o). 0.16/0.44 thf(decl_43, type, locali425460998xt_a_b: partia1833973666xt_a_b > set_a > $o). 0.16/0.44 thf(decl_44, type, suc: nat > nat). 0.16/0.44 thf(decl_45, type, bot_bo1264989578_set_a: set_set_set_a). 0.16/0.44 thf(decl_46, type, bot_bot_set_set_a: set_set_a). 0.16/0.44 thf(decl_47, type, bot_bot_set_a: set_a). 0.16/0.44 thf(decl_48, type, ord_less_eq_int: int > int > $o). 0.16/0.44 thf(decl_49, type, ord_less_eq_nat: nat > nat > $o). 0.16/0.44 thf(decl_50, type, ord_le510494750_set_a: set_set_set_set_a > set_set_set_set_a > $o). 0.16/0.44 thf(decl_51, type, ord_le2103863998_set_a: set_set_set_a > set_set_set_a > $o). 0.16/0.44 thf(decl_52, type, ord_le318720350_set_a: set_set_a > set_set_a > $o). 0.16/0.44 thf(decl_53, type, ord_less_eq_set_a: set_a > set_a > $o). 0.16/0.44 thf(decl_54, type, a_inv_a_b: partia1833973666xt_a_b > a > a). 0.16/0.44 thf(decl_55, type, add_pow_a_b_int: partia1833973666xt_a_b > int > a > a). 0.16/0.44 thf(decl_56, type, add_pow_a_b_nat: partia1833973666xt_a_b > nat > a > a). 0.16/0.44 thf(decl_57, type, add_a_b: partia1833973666xt_a_b > a > a > a). 0.16/0.44 thf(decl_58, type, zero_a_b: partia1833973666xt_a_b > a). 0.16/0.44 thf(decl_59, type, semiring_a_b: partia1833973666xt_a_b > $o). 0.16/0.44 thf(decl_60, type, collect_set_set_a: (set_set_a > $o) > set_set_set_a). 0.16/0.44 thf(decl_61, type, collect_set_a: (set_a > $o) > set_set_a). 0.16/0.44 thf(decl_62, type, collect_a: (a > $o) > set_a). 0.16/0.44 thf(decl_63, type, pow_set_set_a: set_set_set_a > set_set_set_set_a). 0.16/0.44 thf(decl_64, type, pow_set_a: set_set_a > set_set_set_a). 0.16/0.44 thf(decl_65, type, pow_a: set_a > set_set_a). 0.16/0.44 thf(decl_66, type, member_set_set_set_a: set_set_set_a > set_set_set_set_a > $o). 0.16/0.44 thf(decl_67, type, member_set_set_a: set_set_a > set_set_set_a > $o). 0.16/0.44 thf(decl_68, type, member_set_a: set_a > set_set_a > $o). 0.16/0.44 thf(decl_69, type, member_a: a > set_a > $o). 0.16/0.44 thf(decl_70, type, r: partia1833973666xt_a_b). 0.16/0.44 thf(decl_71, type, s: set_a). 0.16/0.44 thf(decl_72, type, t: a). 0.16/0.44 thf(decl_73, type, t2: a). 0.16/0.44 thf(decl_74, type, esk1_2: set_a > set_a > a). 0.16/0.44 thf(decl_75, type, esk2_2: set_a > set_a > a). 0.16/0.44 thf(decl_76, type, esk3_2: set_a > set_a > a). 0.16/0.44 thf(fact_101_subset__iff, axiom, ((ord_less_eq_set_a)=(^[X109:set_a, X110:set_a]:(![X111:a]:(((member_a @ X111 @ X109)=>(member_a @ X111 @ X110)))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_101_subset__iff)). 0.16/0.44 thf(fact_1_subset, axiom, (ord_less_eq_set_a @ s @ (partia1066395285xt_a_b @ r)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_1_subset)). 0.16/0.44 thf(conj_0, conjecture, (member_a @ t2 @ (partia1066395285xt_a_b @ r)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', conj_0)). 0.16/0.44 thf(fact_0_f4, axiom, (member_a @ t2 @ s), file('/export/starexec/sandbox/benchmark/theBenchmark.p', fact_0_f4)). 0.16/0.44 thf(c_0_4, plain, ![X559:set_a, X560:set_a]:(((ord_less_eq_set_a @ X559 @ X560)<=>![X111:a]:(((member_a @ X111 @ X559)=>(member_a @ X111 @ X560))))), inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[fact_101_subset__iff])])). 0.16/0.44 thf(c_0_5, plain, ![X576:set_a, X577:set_a, X578:a, X579:set_a, X580:set_a]:(((~(ord_less_eq_set_a @ X576 @ X577)|(~(member_a @ X578 @ X576)|(member_a @ X578 @ X577)))&(((member_a @ (esk2_2 @ X579 @ X580) @ X579)|(ord_less_eq_set_a @ X579 @ X580))&(~(member_a @ (esk2_2 @ X579 @ X580) @ X580)|(ord_less_eq_set_a @ X579 @ X580))))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])])])])). 0.16/0.44 thf(c_0_6, plain, ![X1:a, X5:set_a, X4:set_a]:(((member_a @ X1 @ X5)|~((ord_less_eq_set_a @ X4 @ X5))|~((member_a @ X1 @ X4)))), inference(split_conjunct,[status(thm)],[c_0_5])). 0.16/0.44 thf(c_0_7, plain, (ord_less_eq_set_a @ s @ (partia1066395285xt_a_b @ r)), inference(split_conjunct,[status(thm)],[fact_1_subset])). 0.16/0.44 thf(c_0_8, negated_conjecture, ~(member_a @ t2 @ (partia1066395285xt_a_b @ r)), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_0])])). 0.16/0.44 thf(c_0_9, plain, ![X1:a]:(((member_a @ X1 @ (partia1066395285xt_a_b @ r))|~((member_a @ X1 @ s)))), inference(spm,[status(thm)],[c_0_6, c_0_7])). 0.16/0.44 thf(c_0_10, plain, (member_a @ t2 @ s), inference(split_conjunct,[status(thm)],[fact_0_f4])). 0.16/0.44 thf(c_0_11, negated_conjecture, ~((member_a @ t2 @ (partia1066395285xt_a_b @ r))), inference(split_conjunct,[status(thm)],[c_0_8])). 0.16/0.44 thf(c_0_12, plain, ($false), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_9, c_0_10]), c_0_11]), ['proof']). 0.16/0.44 # SZS output end CNFRefutation 0.16/0.44 # Parsed axioms : 416 0.16/0.44 # Removed by relevancy pruning/SinE : 392 0.16/0.44 # Initial clauses : 32 0.16/0.44 # Removed in clause preprocessing : 0 0.16/0.44 # Initial clauses in saturation : 32 0.16/0.44 # Processed clauses : 49 0.16/0.44 # ...of these trivial : 0 0.16/0.44 # ...subsumed : 4 0.16/0.44 # ...remaining for further processing : 45 0.16/0.44 # Other redundant clauses eliminated : 6 0.16/0.44 # Clauses deleted for lack of memory : 0 0.16/0.44 # Backward-subsumed : 0 0.16/0.44 # Backward-rewritten : 0 0.16/0.44 # Generated clauses : 17 0.16/0.44 # ...of the previous two non-redundant : 4 0.16/0.44 # ...aggressively subsumed : 0 0.16/0.44 # Contextual simplify-reflections : 0 0.16/0.44 # Paramodulations : 11 0.16/0.44 # Factorizations : 0 0.16/0.44 # NegExts : 0 0.16/0.44 # Equation resolutions : 6 0.16/0.44 # Propositional unsat checks : 0 0.16/0.44 # Propositional check models : 0 0.16/0.44 # Propositional check unsatisfiable : 0 0.16/0.44 # Propositional clauses : 0 0.16/0.44 # Propositional clauses after purity: 0 0.16/0.44 # Propositional unsat core size : 0 0.16/0.44 # Propositional preprocessing time : 0.000 0.16/0.44 # Propositional encoding time : 0.000 0.16/0.44 # Propositional solver time : 0.000 0.16/0.44 # Success case prop preproc time : 0.000 0.16/0.44 # Success case prop encoding time : 0.000 0.16/0.44 # Success case prop solver time : 0.000 0.16/0.44 # Current number of processed clauses : 17 0.16/0.44 # Positive orientable unit clauses : 3 0.16/0.44 # Positive unorientable unit clauses: 0 0.16/0.44 # Negative unit clauses : 1 0.16/0.44 # Non-unit-clauses : 13 0.16/0.44 # Current number of unprocessed clauses: 8 0.16/0.44 # ...number of literals in the above : 26 0.16/0.44 # Current number of archived formulas : 0 0.16/0.44 # Current number of archived clauses : 22 0.16/0.44 # Clause-clause subsumption calls (NU) : 158 0.16/0.44 # Rec. Clause-clause subsumption calls : 146 0.16/0.44 # Non-unit clause-clause subsumptions : 4 0.16/0.44 # Unit Clause-clause subsumption calls : 0 0.16/0.44 # Rewrite failures with RHS unbound : 0 0.16/0.44 # BW rewrite match attempts : 2 0.16/0.44 # BW rewrite match successes : 0 0.16/0.44 # Condensation attempts : 0 0.16/0.44 # Condensation successes : 0 0.16/0.44 # Termbank termtop insertions : 8476 0.16/0.44 0.16/0.44 # ------------------------------------------------- 0.16/0.44 # User time : 0.006 s 0.16/0.44 # System time : 0.005 s 0.16/0.44 # Total time : 0.011 s 0.16/0.44 # Maximum resident set size: 2712 pages 0.16/0.44 0.16/0.44 # ------------------------------------------------- 0.16/0.44 # User time : 0.018 s 0.16/0.44 # System time : 0.006 s 0.16/0.44 # Total time : 0.024 s 0.16/0.44 # Maximum resident set size: 2368 pages 0.16/0.44 EOF